An algorithm for computing a reduct of incomplete decision table
نویسندگان
چکیده
منابع مشابه
Approach to approximate distribution reduct in incomplete ordered decision system
The original rough set model cannot be used to deal with the incomplete information systems. Nevertheless, by relaxing the indiscernibility relation to more general binary relations, many improved rough set models have been successfully applied into the incomplete information systems for knowledge acquisition. This article presents an explorative research focusing on the transition from incompl...
متن کاملA SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS
Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.
متن کاملA SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS
Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new algorithm for computing the detour index of molecular graphs is presented. We apply our algorithm on copper and silver nanoclusters ...
متن کاملReduction Algorithm for Incomplete Decision Table with Continuous Attributes Based on Cloud Model
It is a difficulty in rough set to measure the uncertainty of incomplete information systems, especially whose attributes are continuous, and there are still no effective methods to solve it. From the point of reducing the fuzziness and randomness of samples, a reduction algorithm for incomplete decision table with continuous attributes based on cloud model is proposed. By decision table conver...
متن کاملA Heuristic Optimal Reduct Algorithm
Reduct finding, especially optimal reduct finding, similar to feature selection problem, is a crucial task in rough set applications to data mining, In this paper, we propose a heuristic reduct finding algorithm, which is based on frequencies of attributes appeared in discernibility matrix. Our method does not guarantee to find optimal reduct, but experiment shows that in most situations it doe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Cybernetics
سال: 2012
ISSN: 1813-9663,1813-9663
DOI: 10.15625/1813-9663/25/1/471